#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1010;

int n, m, idx, cnt;
int g[N][N], q[N];

void floyd() {
    for (int k = 1; k <= n; k ++ ) 
        for (int i = 1; i <= n; i ++ ) 
            for (int j = 1; j <= n; j ++ )
                g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}

inline void solution() {
    cin >> n >> m;
    mm(g, INF);
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= n; j ++ )
            if (i == j) g[i][j] = 0;

    for (int i = 1; i <= n; i ++ ) {
        cin >> cnt;
        for (int j = 1; j <= cnt; j ++ ) {
            cin >> idx;
            g[idx][i] = 1;
        }
    }

    floyd();

    for (int i = 1; i <= n; i ++ ) 
        for (int j = 1; j <= n; j ++ ) 
            if (g[i][j] <= m && i != j) 
                q[i] ++;

    int k;
    cin >> k;
    while (k -- ) {
        int u;
        cin >> u;
        cout << q[u] << endl;
    }

}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}